Iterative List Decoding of Concatenated Source-Channel Codes
نویسندگان
چکیده
منابع مشابه
Iterative List Decoding of Concatenated Source-Channel Codes
Whenever variable-length entropy codes are used in the presence of a noisy channel, any channel errors will propagate and cause significant harm. Despite using channel codes, some residual errors always remain, whose effect will get magnified by error propagation. Mitigating this undesirable effect is of great practical interest. One approach is to use the residual redundancy of variable-length...
متن کاملIterative Decoding Trajectories of Parallel Concatenated Codes
Mutual information transfer characteristics for soft in/soft out decoders are proposed as a tool to better understand the convergence behavior of iterative decoding schemes. The exchange of extrinsic information is visualized as a decoding trajectory in the Extrinsic Information Transfer Chart. This allows the prediction of turbo cliff position and bit error rate after an arbitrary number of it...
متن کاملIterative Decoding of Concatenated Codes: A Tutorial
The turbo decoding algorithm of a decade ago constituted a milestone in error-correction coding for digital communications, and has inspired extensions to generalized receiver topologies, including turbo equalization, turbo synchronization, and turbo CDMA, among others. Despite an accrued understanding of iterative decoding over the years, the “turbo principle” remains elusive to master analyti...
متن کاملHybrid Concatenated Codes and Iterative Decoding
A hybrid concatenated code with two interleavers is the parallel concatenation of an encoder, which accepts the permuted version of the information sequence as its input, with a serially concatenated code, which accepts the unpermuted information sequence. The serially concatenated code consists of an outer encoder, an interleaver, and an inner encoder. An upper bound to the average maximum-lik...
متن کاملNotes 10 : List Decoding Reed - Solomon Codes and Concatenated codes
DRAFT Last class, we saw a toy version of recovering from a mixture of two Reed-Solomon codewords the two polynomials in question. Now we turn to list decoding arbitrary received words with a bounded distance from the Reed-Solomon code using Sudan’s [6] algorithm. This algorithm decodes close to a fraction 1 of errors for low rates. Then we will see an improvement by Guruswami and Sudan [4] whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2005
ISSN: 1687-6180
DOI: 10.1155/asp.2005.954